The anti-field-descent method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The anti-field-descent method

The essential fact behind the so-called field-descent method is that certain cyclotomic integers necessarily are contained in relatively small fields and thus must have relatively small complex modulus. In this paper, we develop a method which reveals a complementary phenomenon: certain cyclotomic integers cannot be contained in relatively small fields and thus must have relatively large comple...

متن کامل

Supervised Descent Method

In this dissertation, we focus on solving Nonlinear Least Squares problems using a supervised approach. In particular, we developed a Supervised Descent Method (SDM), performed thorough theoretical analysis, and demonstrated its effectiveness on optimizing analytic functions, and four other real-world applications: Inverse Kinematics, Rigid Tracking, Face Alignment (frontal and multi-view), and...

متن کامل

On the Steepest Descent Method for Matrix

We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...

متن کامل

The Method of Infinite Descent in Stable

This paper is a continuation of [Rav02] and the second in a series of papers intended to clarify and expand results of the last chapter of [Rav04], in which we described a method for computing the Adams-Novikov E2-term and used it to determine the stable homotopy groups of spheres through dimension 108 for p = 3 and 999 for p = 5. The latter computation was a substantial improvement over prior ...

متن کامل

On the Steepest Descent Method for Matrix

We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2016

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2015.11.005